Moving boundary truncated grid method: Multidimensional quantum dynamics

The moving boundary truncated grid (TG) method is used to study wave packet dynamics of multidimensional quantum systems. As time evolves, appropriate Eulerian grid points required for propagating a wave packet are activated and deactivated with no advance information about the dynamics. This method is applied to the Henon-Heiles potential and wave packet barrier scattering in two, three, and four dimensions. Computational results demonstrate that the TG method not only leads to a great reduction in the number of grid points needed to perform accurate calculations but also is computationally more efficient than the full grid calculations.     

一种基于网格模型的无限传感器网络K区域覆盖算法

目前无限传感器网络K覆盖问题的解决机制大都有颇为苛刻的假设条件,如要求节点具有很强的能量、节点的感知区域能被精确定义等.提出了一个基于布尔感知理论的分布式网格模型及相应的K区域覆盖算法,能够很好地处理感知区域形状不规则及大小发生变化的K覆盖问题,算法时间复杂度小,适用范围广泛.仿真实验证明了算法的有效性.     

A reduced domain strategy for local mesh movement application in unstructured grids

Automatic control of mesh movement is mandatory in many fluid flow and fluid-solid interaction problems. This paper presents a new strategy, called reduced domain strategy (RDS), which enhances the efficiency of node connectivity-based mesh movement methods and moves the unstructured grid locally and effectively. The strategy dramatically reduces the grid computations by dividing the unstructured grid into two active and inactive zones. After any local boundary movement, the grid movement is performed only within the active zone. To enhance the efficiency of our strategy, we also develop an automatic mesh partitioning scheme. This scheme benefits from a new quasi-structured mesh data ordering, which determines the boundary of active zone in the original unstructured grid very easily. Indeed, the new partitioning scheme eliminates the need for sequential reordering of the original unstructured grid data in different mesh movement applications. We choose the spring analogy method and apply our new strategy to perform local mesh movements in two boundary movement problems including a multi-element airfoil with moving slat or deforming main body section. We show that the RDS is robust and cost effective. It can be readily employed in different node connectivity-based mesh movement methods. Indeed, the RDS provides a flexible local grid deformation tool for moving grid applications.     

A unified three point approximating subdivision scheme

In this paper,we propose a three point approximating subdivision scheme,with three shape parameters,that unifies three different existing three point approximating schemes.Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed.The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling.     

A Poisson–Boltzmann solver on irregular domains with Neumann or Robin boundary conditions on non-graded adaptive grid

We introduce a second-order solver for the Poisson–Boltzmann equation in arbitrary geometry in two and three spatial dimensions. The method differs from existing methods solving the Poisson–Boltzmann equation in the two following ways: first, non-graded Quadtree (in two spatial dimensions) and Octree (in three spatial dimensions) grid structures are used; Second, Neumann or Robin boundary conditions are enforced at the irregular domain’s boundary. The irregular domain is described implicitly and the grid needs not to conform to the domain’s boundary, which makes grid generation straightforward and robust. The linear system is symmetric, positive definite in the case where the grid is uniform, nonsymmetric otherwise. In this case, the resulting matrix is an M-matrix, thus the linear system is invertible. Convergence examples are given in both two and three spatial dimensions and demonstrate that the solution is second-order accurate and that Quadtree/Octree grid structures save a significant amount of computational power at no sacrifice in accuracy.     

Numerical modeling of transient two-dimensional viscoelastic waves

This paper deals with the numerical modeling of transient mechanical waves in linear viscoelastic solids. Dissipation mechanisms are described using the generalized Zener model. No time convolutions are required thanks to the introduction of memory variables that satisfy local-in-time differential equations. By appropriately choosing the relaxation parameters, it is possible to accurately describe a large range of materials, such as solids with constant quality factors. The evolution equations satisfied by the velocity, the stress, and the memory variables are written in the form of a first-order system of PDEs with a source term. This system is solved by splitting it into two parts: the propagative part is discretized explicitly, using a fourth-order ADER scheme on a Cartesian grid, and the diffusive part is then solved exactly. Jump conditions along the interfaces are discretized by applying an immersed interface method. Numerical experiments of wave propagation in viscoelastic and fluid media show the efficiency of this numerical modeling for dealing with challenging problems, such as multiple scattering configurations.     

Rotor wake capture improvement based on high-order spatially accurate schemes and chimera grids

A high-order upwind scheme has been developed to capture the vortex wake of a helicopter rotor in the hover based on chimera grids. In this paper, an improved fifth-order weighted essentially non-oscillatory (WENO) scheme is adopted to interpolate the higher-order left and right states across a cell interface with the Roe Riemann solver updating inviscid flux, and is compared with the monotone upwind scheme for scalar conservation laws (MUSCL). For profitably capturing the wake and enforcing the period boun...     

Computations of wall distances by solving a transport equation

Computations of wall distances still play a key role in modern turbulence modeling. Motivated by the expense involved in the computation, an approach solving partial differential equations is considered. An Euler-like transport equation is proposed based on the Eikonal equation. Thus, the efficient algorithms and code components developed for solving transport equations such as Euler and Navier-Stokes equations can be reused. This article provides a detailed implementation of the transport equation in the Cartesian coordinates based on the code of computational fluid dynamics for missiles (MICFD) of Beihang University. The transport equation is robust and rapidly convergent by the implicit lower-upper symmetric Gauss-Seidel (LUSGS) time advancement and upwind spatial discretization. Geometric derivatives must also be upwind determined to ensure accuracy. Special treatments on initial and boundary conditions are discussed. This distance solving approach is successfully applied on several complex geometries with 1-1 blocking or overset grids.     

基于混合网格Navier-Stokes方程的并行隐式计算方法研究

针对结构网格很难处理复杂外形和非结构网格无法计算具有边界层的粘性流动的缺点,发展了基于混合网格格点的隐式算法,成功地解决了在工程应用中难于处理的复杂外形粘性流场计算和效率问题。同时针对大规模的工程问题,发展了基于MPI通信技术的染色分层通讯并行计算方法。其中空间离散采用基于Roe格式发展的三阶迎风HLLEW(Harten-Lax-Van Leer-Einfeldt-Wada)或AUSM格式,湍流模型采用k??两方程湍流模型,时间推进考虑到LU-SGS并行等效较困难则采用基于DP-LUR(Data-Parallel Lower-Upper Relaxation)格式的隐式算法,计算CFL数可取到105量级,从2个到128个CPU的并行加速效率都保持在90%以上,大大提高了计算效率。算例对标模M6机翼模型流场进行计算,验证了方法的可靠性;然后对标模DLR-F6翼身组合体进行混合网格粘性与无粘计算结果进行比较,进一步验证混合网格方法;最后计算了DLR-WBNP外挂发动机翼身组合体模型,准确模拟了外挂和超临界机翼的相互干扰流动问题,采用4 CPU 16 CORE到24 CPU 96 CORE,2000步计算时间都不超...     

基于贴体网格的VOF方法数模流场研究

提出了一种基于VOF方法的模拟具有复杂边界形状结构物附近流场的新算法,BFC—SIMPLE—VOF算法。采用坐标变换方法实现了任意复杂区域的结构化网格划分,在贴体网格下对二维不可压缩粘性流体的控制方程进行了离散。提出了基于交错网格的修正SIMPLE算法来迭代求解压力一速度场,修正了贴体坐标下的界面跟踪方法（VOF方法）...